CONFIDENCE REGION METHOD FOR A STOCHASTIC PROGRAMMING PROBLEM
نویسندگان
چکیده
منابع مشابه
A Suggested Approach for Stochastic Interval-Valued Linear Fractional Programming problem
In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...
متن کاملConfidence level solutions for stochastic programming
We propose an alternative approach to stochastic programming based on MonteCarlo sampling and stochastic gradient optimization. The procedure is by essence probabilistic and the computed solution is a random variable. The associated objective value is doubly random, since it depends on two outcomes: the event in the stochastic program and the randomized algorithm. We propose a solution concept ...
متن کاملOn a dual method for a specially structured linear programming problem with application to stochastic programming
The paper revises and improves on a Dual Type Method DTM devel oped by A Pr ekopa in two ways The rst improvement allows us in each iteration to perform the largest step toward the optimum The second inprovement consists of exploting the structure of the working basis which has to be inverted in each iteration of the DTM and updating its inverse in product form as it is usual in case of the sta...
متن کاملConfidence-based Reasoning in Stochastic Constraint Programming
In this work we introduce a novel approach, based on sampling, for finding policies that are likely to be solutions to stochastic constraint satisfaction problems and constraint optimisation problems. Our approach reduces the size of the original problem being analysed and it guarantees that, with a given confidence probability, the policies produced by solving this reduced problem satisfy the ...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1987
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.30.218